Fooling the Team Is Tougher Now

نویسندگان

  • Mark D. Levin
  • Hossein Saiedian
چکیده

dependent (“intensive” is frequently misleading) system. Based on my experience with SCEs, I would like to offer the following additional comments. The Source Selection Evaluation Board should tailor the investigation to the particular project under consideration. If the project has more hardware development than software, the SCE should have a systems engineering flavor, and the evaluation team members’ experience should touch on all of the projected system’s domains. The evaluators should concentrate their efforts on the most significant characteristics of contractor capability. The small number of going-in questions should be open-ended. Their answers should provoke additional questions by the evaluators. The evaluators should spend time in one-on-one meetings with their opposite number. They should encourage interviewees to demonstrate how they use proposed tools and to show off their domain knowledge and their familiarity with the proposed software development plan. They should quiz interviewees about the projects they are working on to get some feel of whether the current work would be used on the project under source selection. There are other commonsense tricks to running an SCE, but—as the authors pointed out quite well—success ultimately depends on the team’s competence. Mark D. Levin Eglin AFB, Fla. [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalizable Data-free Objective for Crafting Universal Adversarial Perturbations

Machine learning models are susceptible to adversarial perturbations: small changes to input that can cause large changes in output. It is also demonstrated that there exist input-agnostic perturbations, called universal adversarial perturbations, which can change the inference of target model on most of the data samples. However, existing methods to craft universal perturbations are (i) task s...

متن کامل

The Evaluation of the Team Performance of MLB Applying PageRank Algorithm

Background. There is a weakness that the win-loss ranking model in the MLB now is calculated based on the result of a win-loss game, so we assume that a ranking system considering the opponent’s team performance is necessary. Objectives. This study aims to suggest the PageRank algorithm to complement the problem with ranking calculated with winning ratio in calculating team ranking of US MLB. ...

متن کامل

Fooling-sets and rank

ABSTRACT. An n×n matrix M is called a fooling-set matrix of size n if its diagonal entries are nonzero and Mk,lMl,k = 0 for every k 6= l. Dietzfelbinger, Hromkovič, and Schnitger (1996) showed that n ≤ (rkM)2 , regardless of over which field the rank is computed, and asked whether the exponent on rkM can be improved. We settle this question. In characteristic zero, we construct an infinite fami...

متن کامل

Fooling Pairs in Randomized Communication Complexity

The fooling pairs method is one of the standard methods for proving lower bounds for deterministic two-player communication complexity. We study fooling pairs in the context of randomized communication complexity. We show that every fooling pair induces far away distributions on transcripts of private-coin protocols. We use the above to conclude that the private-coin randomized ε-error communic...

متن کامل

The (Minimum) Rank of Typical Fooling-Set Matrices

A fooling-set matrix is a square matrix with nonzero diagonal, but at least one in every pair of diagonally opposite entries is 0. Dietzfelbinger et al. ’96 proved that the rank of such a matrix is at least √ n, for a matrix of order n. We ask for the typical minimum rank of a fooling-set matrix: For a fooling-set zerononzero pattern chosen at random, is the minimum rank of a matrix with that z...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000